Markov Model Checking of Probabilistic Boolean Networks Representations of Genes
نویسندگان
چکیده
Our goal is to develop an algorithm for the automated study of the dynamics of Probabilistic Boolean Network (PBN) representation of genes. Model checking is an automated method for the verification of properties on systems. Continuous Stochastic Logic (CSL), an extension of Computation Tree Logic (CTL), is a model-checking tool that can be used to specify measures for Continuous-time Markov Chains (CTMC). Thus, as PBNs can be analyzed in the context of Markov theory, the use of CSL as a method for model checking PBNs could be a powerful tool for the simulation of gene network dynamics. Particularly, we are interested in the subject of intervention. This refers to the deliberate perturbation of the network with the purpose of achieving a specific behavior. This is attained by selectively changing the parameters in a node or set of nodes so that the network behavior can be controlled.
منابع مشابه
Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks
MOTIVATION Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates rule-based dependencies between genes; (ii) allows the systematic study of global network dynamics; (iii) is able to cope with uncertainty, both in the data and the model selection; and (iv) permits the quantification of the relative influence and sensitivity of genes in their...
متن کاملFrom Boolean to Probabilistic Boolean Networks as Models of Genetic Regulatory Networks
Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles governing biological systems in an integrative and holistic manner. It also paves the way toward the development of systematic approaches for effective therapeutic intervention in disease. The central theme in this paper is the Boolean formalism as a building block for modeling ...
متن کاملProbabilistic Gene Regulatory Networks, isomorphisms of Markov Chains
In this paper we study homomorphisms of Probabilistic Regulatory Gene Networks(PRN) introduced in [2]. The model PRN is a natural generalization of the Probabilistic Boolean Networks (PBN), introduced by I. Shmulevich, E. Dougherty, and W. Zhang in [14], that has been using to describe genetic networks and has therapeutic applications, see [15]. In this paper, our main objectives are to apply t...
متن کاملDynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes
We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstractions of general Markov processes. Our abstraction differs from existing approaches in two ways. First, we exploit the structure of the underlying Markov process to compute the abstractio...
متن کاملGeneralized Craig Interpolation for Stochastic Boolean Satisfiability Problems
The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, among them bounded model checking (BMC) of symbolically represented Markov decision processes. This paper identifies a notion of Craig interpolant for the ...
متن کامل